Two quasiparticle wobbling in the even-even nucleus 130Ba
نویسندگان
چکیده
منابع مشابه
Finite groups have even more centralizers
For a finite group $G$, let $Cent(G)$ denote the set of centralizers of single elements of $G$. In this note we prove that if $|G|leq frac{3}{2}|Cent(G)|$ and $G$ is 2-nilpotent, then $Gcong S_3, D_{10}$ or $S_3times S_3$. This result gives a partial and positive answer to a conjecture raised by A. R. Ashrafi [On finite groups with a given number of centralizers, Algebra Collo...
متن کاملExtending the two to one Relationship Between the Spectra of Even-Even and Neighbouring Even-Odd Nuclei
In the single j shell there is a two to one relationship between the spectra of certain even-even and neighbouring even-odd (or odd-even) nuclei e.g. the calculated energy levels of J=0+ states in 44Ti are at twice the energies of corresponding levels in 43Ti(43Sc) with J=j=7/2. Here an approximate extension of the relationship is made by making a truncation in seniority e.g. for 46Ti and 45Sc ...
متن کاملMaking Even Swaps Even Easier
This paper introduces an approach to support different phases of the Even Swaps process by Preference Programming, which is a framework for modeling incomplete information within multiattribute value theory. In the approach, the Even Swaps process is carried out as usual, but in parallel the preferences of the decision maker are modeled with a Preference Programming model, which is also updated...
متن کاملFinding Even Cycles Even Faster
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k ≥ 2, there is an O(V ) time algorithm that decides whether an undirected graph G = (V,E) contains a simple cycle of length 2k and finds one if it does. (ii) There is an O(V ) time algorithm that finds a shortest even cycle in an undirected graph G = (V,E).
متن کاملFinding Even Subgraphs Even Faster
Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on n vertices and a positive integer parameter k, find if there exist k edges (arcs) whose deletion results in a graph that satisfies some specified parity constraints. In particular, when the objective is to obtain a connected graph in which all th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters B
سال: 2020
ISSN: 0370-2693
DOI: 10.1016/j.physletb.2020.135246